Weighted Non-Trivial Multiply Intersecting Families

نویسندگان

  • Peter Frankl
  • Norihide Tokushige
چکیده

Let n,r and t be positive integers. A family F of subsets of [n]={1,2, . . . ,n} is called r-wise t-intersecting if |F1∩·· ·∩Fr|≥ t holds for all F1, . . . ,Fr ∈F . An r-wise 1-intersecting family is also called an r-wise intersecting family for short. An r-wise t-intersecting family F is called non-trivial if |⋂F∈F F |<t. Let us define the Brace–Daykin structure as follows. F BD = {F ⊂ [n] : |F ∩ [r + 1]| ≥ r}. Then Fr BD is a non-trivial r-wise intersecting family. Brace and Daykin proved the following.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiply-intersecting families revisited

Motivated by the Frankl’s results in [11] (“Multiply-intersecting families,” J. Combin. Theory (B) 1991), we consider some problems concerning the maximum size of multiply-intersecting families with additional conditions. Among other results, we show the following version of the Erdős–Ko–Rado theorem: for all r ≥ 8 and 1≤ t ≤ 2r+1−3r−1 there exist positive constants ε and n0 such that if n > n0...

متن کامل

Intersecting Families — Uniform versus Weighted

What is the maximal size of k-uniform r-wise t-intersecting families? We show that this problem is essentially equivalent to determine the maximal weight of non-uniform r-wise t-intersecting families. Some EKR type examples and their applications are included.

متن کامل

The Typical Structure of Intersecting Families

When t = 1, we simply say that the family is intersecting. Consider the following example. Fix a t-set, say I ⊆ [n], and values {xi : i ∈ I}. If for every σ ∈ F and i ∈ I σ(i) = xi, then F is clearly t-intersecting. Furthermore, we say that F is a trivial t-intersecting family of permutations. Note that the size of this family is at most (n − t)!. Ellis, Friedgut, and Pilpel [5] show that for n...

متن کامل

The maximum size of intersecting and union families of sets

We consider the maximal size of families of k-element subsets of an n element set [n] = {1, 2, . . . , n} that satisfy the properties that every r subsets of the family have non-empty intersection, and no ` subsets contain [n] in their union. We show that for large enough n, the largest such family is the trivial one of all ( n−2 k−1 ) subsets that contain a given element and do not contain ano...

متن کامل

Non-trivial intersecting uniform sub-families of hereditary families

For a family F of sets, let μ(F) denote the size of a smallest set in F that is not a subset of any other set in F , and for any positive integer r, let F (r) denote the family of r-element sets in F . We say that a family A is of Hilton-Milner (HM ) type if for some A ∈ A, all sets in A\{A} have a common element x / ∈ A and intersect A. We show that if a hereditary family H is compressed and μ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Combinatorica

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2006